2D Hexagonal Finite Fuzzy Cellular Automata
نویسندگان
چکیده
In this paper 2D hexagonal finite fuzzy cellular automata defined by transition of local rules based on cell structure are studied. Here the inverse problem is also
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملFuzzy hexagonal automata and snowflakes
There is a common perception that snowflakes are 6-sided and a common quip that "no two snowflakes are alike". The 6-fold symmetry suggests that the growth is deterministic, while the differences suggest the growth is so sensitive to conditions that remarkable variety appears. We investigate fuzzy automata that give a great diversity of growth patterns, have sensitivity to background conditions...
متن کاملUniversality of Reversible Hexagonal Cellular Automata
We define a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA H1, and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of H1 is concluded. Although the number of states of H1 is greater than those of t...
متن کاملSimulating 3D Cellular Automata with 2D Cellular Automata
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.
متن کاملFuzzy Evolutionary Cellular Automata
Genetic algorithms are powerful tools that allow engineers and scientists to find good solutions to hard computational problems using evolutionary principles. The classic genetic algorithm has several disadvantages, however. Foremost among these drawbacks is the difficulty of choosing optimal parameter settings. Genetic algorithm literature is full of empirical tricks, techniques, and rules of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematics and Applications
سال: 2022
ISSN: ['0975-8607', '0976-5905']
DOI: https://doi.org/10.26713/cma.v13i1.1696